Drawing Straight Lines
نویسنده
چکیده
lines, pseudolines, polar coordinates, trilinear coordinates, non-linear programming, geometry We present a graph-drawing algorithm which respects extended co-linearity constraints. These are expressed as a set of ‘straight’ paths in a planar graph. Constraints of this sort are translated into a set of inequalities over polar coordinates of lines. These inequalities provide necessary and sufficient conditions for the lines to be an appropriate drawing of the graph. Combined with a formula expressing some aesthetic parameter these inequalities then express the graph drawing problem as a classic non-linear program. These inequalities are solved by first solving linear inequalities in the angles, and then tackling the full non-linear program. The solution is a drawing of the graph. The algorithm has been used to draw all the solutions to the 6-Venn triangle problem.
منابع مشابه
Area-eecient Algorithms for Upward Straight-line Tree Drawings ?
In this paper, we investigate planar upward straight-line grid drawing problems for bounded-degree rooted trees so that a drawing takes up as little area as possible. A planar upward straight-line grid tree drawing satisses the following four constraints: (1) all vertices are placed at distinct grid points (grid), (2) all edges are drawn as straight lines (straight-line), (3) no two edges in th...
متن کاملDrawing Planar Graphs with Reduced Height
A straight-line (respectively, polyline) drawing Γ of a planar graph G on a set Lk of k parallel lines is a planar drawing that maps each vertex of G to a distinct point on Lk and each edge of G to a straight line segment (respectively, a polygonal chain with the bends on Lk) between its endpoints. The height of Γ is k, i.e., the number of lines used in the drawing. In this paper we compute new...
متن کاملOn Drawing Anti-Aliased Straight Lines
In this paper, an efficient algorithm is presented for drawing anti-aliased straight lines for two grey-level case; experimental results show that it is faster than Liu’s algorithm [6]. Specifically, Liu’s algorithm determines the grey-level of one pixel at a time while our algorithm determines the grey-levels of many pixels at the same time. In addition, our results for the two grey-level case...
متن کاملLines and How To Draw Them
The drawing of lines on the computer has been an area of interest for several years. In the beginning, there were more practical reasons behind the development of line drawing algorithms (as for instence the rasterization of lines by Bresenham), later more esthetic reasons came into play. This article gives an overview of techniques for drawing lines with certain effects. A line in this context...
متن کاملEye movements in drawing simple lines.
As part of an investigation into real-world drawing, eye movements and eye-hand interactions have been recorded for twenty subjects of varying drawing experience drawing simple straight and curved lines and a square. Two modes of eye-hand behaviour were observed. In the first, named 'close pursuit', fixations closely followed the pencil with a sequence of small saccades. In the second, named 't...
متن کامل